cTI : Bottom - Up Termination
نویسندگان
چکیده
We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are not necessary. Instead, all provably terminating classes to all related predicates are inferred at once. The architecture of cTI is discussed, highlighting several new aspects to termination analysis. The notion of termination neutral arguments is introduced, which helps to narrow down the actual arguments responsible for termination in a norm independent manner. We show how our approach can be adopted to realize an incremental system able to reuse previously inferred results, thereby allowing to use the system within a programming environment. Further we show how termination inference serves to tackle generalizations of the usual notion of termination.
منابع مشابه
Implementing cTI : a constraint - basedleft - termination inference tool for LPS
We present the implementation of cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analysis/checking. The architecture of cTI is presented and some optimizations and performance results for medium-sized programs are discussed.
متن کاملcTI: A constraint-based termination inference tool for ISO-Prolog
We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, for instance by means of user annotations. Moreover, the analysis must be redone every time the c...
متن کاملApplying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference generalizes termination analysis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With te...
متن کاملTypical Atrial Flutter - When Do You Say You Have Got It.
Right Atrial Flutter (AFL) is a common form of macro reentrant arrhythmia.1-3 In absence of previous cardiac surgery, the reentry circuit is usually bounded anteriorly by the tricuspid annulus (TA) and posteriorly by the ostia of vena cava and Eustachian ridge. In this case, AFL is consensually called “typical” AFL and is highly dependent of the cavotricuspid isthmus (CTI).2 The CTI is a critic...
متن کامل